Hierarchical transformation invariant clustering
نویسندگان
چکیده
We present a novel generative model for transformation invariant data clustering, with the emphasis on video clustering and summarization. We model the data as the mixture of transformed exemplars. We include in the model the most common and realistic transformations in video data: camera motion, cropping, change in scale and light. The learning procedure automatically clusters video frames into video scenes and objects. The learning algorithm is based on a hierarchical, on-line EM algorithm. Fast Fourier transform is used for rapid inference and learning. We use the model to: 1. perform video clustering by grouping similar (up to translation, scale and lighting) video frames into clusters; 2. robustly stabilize video frames by compensating for translation, scale and lighting changes. We believe that video scene modelling of this kind is essential to bridge the semantic gap in video understanding. We illustrate this with several excellent results, both in terms of speed and accuracy.
منابع مشابه
Transform-Invariant Non-Parametric Clustering of Covariance Matrices and its Application to Unsupervised Joint Segmentation and Action Discovery
In this work, we tackle the problem of transform-invariant unsupervised learning in the space of Covariance matrices and applications thereof. We begin by introducing the Spectral Polytope Covariance Matrix (SPCM) Similarity function; a similarity function for Covariance matrices, invariant to any type of transformation. We then derive the SPCMCRP mixture model, a transform-invariant non-parame...
متن کاملModel reduction for LPV systems based on approximate modal decomposition
The paper presents a novel model order reduction technique for large-scale linear parameter varying (LPV) systems. The approach is based on decoupling the original dynamics into smaller dimensional LPV subsystems that can be independently reduced by parameter varying reduction methods. The decomposition starts with the construction of a modal transformation that separates the modal subsystems. ...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملHierarchical Fuzzy Clustering Semantics (HFCS) in Web Document for Discovering Latent Semantics
This paper discusses about the future of the World Wide Web development, called Semantic Web. Undoubtedly, Web service is one of the most important services on the Internet, which has had the greatest impact on the generalization of the Internet in human societies. Internet penetration has been an effective factor in growth of the volume of information on the Web. The massive growth of informat...
متن کاملOn Affine Invariant Clustering and Automatic Cast Listing in Movies
We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters. Such clustering requirements are generic to a number of problems in computer vision. We extend existing techniques for affine-invariant clustering, and show that the new distance metric outperforms existing approximations to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004